A root-finding algorithm for cubics
نویسندگان
چکیده
منابع مشابه
Mcmullen’s Root-finding Algorithm for Cubic Polynomials
We show that a generally convergent root-finding algorithm for cubic polynomials defined by C. McMullen is of order 3, and we give generally convergent algorithms of order 5 and higher for cubic polynomials. We study the Julia sets for these algorithms and give a universal rational map and Julia set to explain the dynamics.
متن کاملA new root-based direction-finding algorithm
[1] Polynomial rooting direction-finding (DF) algorithms are a computationally efficient alternative to search-based DF algorithms and are particularly suitable for uniform linear arrays of physically identical elements provided that mutual interaction among the array elements can be either neglected or compensated for. A popular algorithm in such situations is Root Multiple Signal Classificati...
متن کاملAN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملRoot-finding and Root-refining for a Polynomial Equation
Polynomial root-finders usually consist of two stages. At first a crude approximation to a root is slowly computed; then it is much faster refined by means of the same or distinct iteration. The efficiency of computing an initial approximation resists formal study, and the users rely on empirical data. In contrast, the efficiency of refinement is formally measured by the classical concept q whe...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2012
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-2012-11324-3